Tootfinder

Unionized editorial workers at LexisNexis-owned Law360 authorize a strike; the union says the vote is partly due to planned layoffs after record profits in 2023 (Chris Roush/Talking Biz News)
https://talkingbiznews.com/media-news/law360-staffers-vote-to-strik…

Law360 staffers vote to strike - Talking Biz News
Unionized editorial workers at LexisNexis-owned Law360 voted to authorize a strike Monday. The union says the strike is due to lack of progress at the bargaining table, unlawful tactics that violate union members’ rights and planned layoffs following record profits in 2023. Law360 Union is part of the NewsGuild of New York, which represents nearly […]

Unionized editorial workers at LexisNexis-owned Law360 authorize a strike; the union says the vote is partly due to planned layoffs after record profits in 2023 (Chris Roush/Talking Biz News)
https://talkingbiznews.com/media-news/law360-staffers-vote-to-strik…

Law360 staffers vote to strike - Talking Biz News
Unionized editorial workers at LexisNexis-owned Law360 voted to authorize a strike Monday. The union says the strike is due to lack of progress at the bargaining table, unlawful tactics that violate union members’ rights and planned layoffs following record profits in 2023. Law360 Union is part of the NewsGuild of New York, which represents nearly […]

Praia do Barill, Tavira, Portugal 2012 (official naturist beach)
me, having fun :-)
#meermittwoch

In a surprise vote, major European climate protection plan shelved following farmer protests
https://apnews.com/article/eu-climate-nature-protection-farmers-protests-7b222f346d4898e32766b230da781385

In a surprise vote, major European climate protection plan shelved following farmer protests
A major European Union plan to fight climate change and better protect nature in the 27-nation bloc has been indefinitely postponed , underscoring how farmers’ protests sweeping the continent influence politics ahead of the June EU parliamentary elections..Monday was supposed to be the day the member states gave their final approval to the plan. But what was to be a mere rubber stamp following months of proceedings through the EU’s institutional maze has now been indefinitely postponed. It …

This https://arxiv.org/abs/2304.09155 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Rainbow Hamiltonicity in uniformly coloured perturbed digraphs
We investigate the existence of a rainbow Hamilton cycle in a uniformly edge-coloured randomly perturbed digraph. We show that for every $δ\in (0,1)$ there exists $C = C(δ) > 0$ such that the following holds. Let $D_0$ be an $n$-vertex digraph with minimum semidegree at least $δn$ and suppose that each edge of the union of $D_0$ with the random digraph $D(n, p)$ on the same vertex set gets a colour in $[n]$ independently and uniformly at random. Then, with high probability, $D_0 \cup D(n, p)…

Amazing to see. We need more of this!
'Embracer-owned studio Flying Wild Hog has unionized'
https://www.gamedeveloper.com/business/embracer-owned-studio-flying-wild-hog-has-unionized

Embracer-owned studio Flying Wild Hog has unionized
The union hopes to "change the industry for the better."

Guarantee that the #Earlyworm #podcast will be a thoughtful & engaging show to listen to. Rec subscribing! @…

Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph
Xifan Yu, Ilias Zadik, Peiyuan Zhang
https://arxiv.org/abs/2403.17766 https://…

Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph
We study the computational limits of the following general hypothesis testing problem. Let H=H_n be an \emph{arbitrary} undirected graph on n vertices. We study the detection task between a ``null'' Erdős-Rényi random graph G(n,p) and a ``planted'' random graph which is the union of G(n,p) together with a random copy of H=H_n. Our notion of planted model is a generalization of a plethora of recently studied models initiated with the study of the planted clique model (Jerrum 1992), which corre…

This https://arxiv.org/abs/2304.09155 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Rainbow Hamiltonicity in uniformly coloured perturbed digraphs
We investigate the existence of a rainbow Hamilton cycle in a uniformly edge-coloured randomly perturbed digraph. We show that for every $δ\in (0,1)$ there exists $C = C(δ) > 0$ such that the following holds. Let $D_0$ be an $n$-vertex digraph with minimum semidegree at least $δn$ and suppose that each edge of the union of $D_0$ with the random digraph $D(n, p)$ on the same vertex set gets a colour in $[n]$ independently and uniformly at random. Then, with high probability, $D_0 \cup D(n, p)…